- programming under uncertainty
- Математика: программирование в условиях неопределённости
Универсальный англо-русский словарь. Академик.ру. 2011.
Универсальный англо-русский словарь. Академик.ру. 2011.
Stochastic programming — is a framework for modeling optimization problems that involve uncertainty. Whereas deterministic optimization problems are formulated with known parameters, real world problems almost invariably include some unknown parameters. When the… … Wikipedia
Extreme Programming — (or XP) is a software engineering methodology (and a form of agile software development) Human Centred Technology Workshop 2005 , 2005, PDF webpage: [ftp://ftp.informatics.sussex.ac.uk/pub/reports/csrp/csrp585.pdf Informatics UK report cdrp585]… … Wikipedia
Nonlinear programming — In mathematics, nonlinear programming (NLP) is the process of solving a system of equalities and inequalities, collectively termed constraints, over a set of unknown real variables, along with an objective function to be maximized or minimized,… … Wikipedia
George Bernard Dantzig — George Dantzig George Bernard Dantzig (8 novembre 1914 à Portland, Oregon 13 mai 2005 à Palo Alto, Californie) était un mathématicien américain qui a créé l algorithme du simplexe et est considéré comme le fondateur de la programmation… … Wikipédia en Français
Info-gap decision theory — is a non probabilistic decision theory that seeks to optimize robustness to failure – or opportuneness for windfall – under severe uncertainty,[1][2] in particular applying sensitivity analysis of the stability radius type[3] to perturbations in… … Wikipedia
Non-convexity (economics) — In economics, non convexity refers to violations of the convexity assumptions of elementary economics. Basic economics textbooks concentrate on consumers with convex preferences (that do not prefer extremes to in between values) and convex budget … Wikipedia
Artificial intelligence — AI redirects here. For other uses, see Ai. For other uses, see Artificial intelligence (disambiguation). TOPIO, a humanoid robot, played table tennis at Tokyo International Robot Exhibition (IREX) 2009.[1] Artificial intelligence ( … Wikipedia
Bellman equation — A Bellman equation (also known as a dynamic programming equation), named after its discoverer, Richard Bellman, is a necessary condition for optimality associated with the mathematical optimization method known as dynamic programming. It writes… … Wikipedia
Convexity in economics — Economics … Wikipedia
George Dantzig — George Bernard Dantzig (Nov 8 1914 ndash; May 13 2005) was an American mathematician, and the Professor Emeritus of Transportation Sciences and Professor of Operations Research and of Computer Science at Stanford. George Dantzig is known as the… … Wikipedia
Mathematical economics — Economics … Wikipedia